High-Dimensional Mahalanobis Distances of Complex Random Vectors

Independence Test for High Dimensional Random Vectors

This paper proposes a new mutual independence test for a large number of high dimensional random vectors. The test statistic is based on the characteristic function of the empirical spectral distribution of the sample covariance matrix. The asymptotic distributions of the test statistic under the null and local alternative hypotheses are established as dimensionality and the sample size of the ...

Learning Local Invariant Mahalanobis Distances

For many tasks and data types, there are natural transformations to which the data should be invariant or insensitive. For instance, in visual recognition, natural images should be insensitive to rotation and translation. This requirement and its implications have been important in many machine learning applications, and tolerance for image transformations was primarily achieved by using robust...

Autoregressive Gaussian Random Vectors of First Order

Parsimonious Mahalanobis kernel for the classification of high dimensional data

The classification of high dimensional data with kernel methods is considered in this article. Exploiting the emptiness property of high dimensional spaces, a kernel based on the Mahalanobis distance is proposed. The computation of the Mahalanobis distance requires the inversion of a covariance matrix. In high dimensional spaces, the estimated covariance matrix is ill-conditioned and its invers...

Estimation of Spectral Measure of Stable Random Vectors

This article has no abstract.